16 research outputs found

    Advanced spectrum management for the downlink of WCDMA systems using genetic algorithms

    Get PDF
    In this paper, we propose an advanced spectrum management approach for the downlink of WCDMA systems using genetic algorithms and the concept of coupling matrix, which is able to capture inter-cell interactions. Simulation results show that the proposed approach increases spectrum efficiency while guaranteeing the required QoS levels. Moreover, it allows releasing carriers in some cells, so that they could be eventually used by e.g. secondary cognitive radio users exploiting the flexible spectrum allocation and opportunistic spectrum access.Peer Reviewe

    Advanced spectrum management for the downlink of WCDMA systems using genetic algorithms

    No full text
    In this paper, we propose an advanced spectrum management approach for the downlink of WCDMA systems using genetic algorithms and the concept of coupling matrix, which is able to capture inter-cell interactions. Simulation results show that the proposed approach increases spectrum efficiency while guaranteeing the required QoS levels. Moreover, it allows releasing carriers in some cells, so that they could be eventually used by e.g. secondary cognitive radio users exploiting the flexible spectrum allocation and opportunistic spectrum access.Peer Reviewe

    Opportunistic channel allocation algorithms for WLANs based on IEEE802.11

    No full text
    The deployment of highly dense wireless local area networks (WLAN) can cause an excessive level of interference in the commonly used 2.4 GHz ISM band, which leads to network performance degradation. This paper analyses the possibility to reduce congestion in the crowded ISM band by allowing some access points (APs) to opportunistically operate in a primary band. Although the problem of opportunistic channel allocation considering both ISM and primary bands can be formulated mathematically as a Binary Linear Programming (BLP) problem, existing algorithms (e.g., branch and bound) capable to provide optimal solutions for BLP problems are quite inefficient for large deployments. Therefore, we propose three different heuristic algorithms to solve this opportunistic channel allocation problem by properly extending graph coloring algorithms: First Fit (FF), Saturation Degree Ordering (SDO) and Minimum Spanning Tree (MST). A performance analysis of the three algorithms is carried out under different conditions of primary band availability and AP densit

    Opportunistic channel allocation algorithms for WLANs based on IEEE802.11

    No full text
    The deployment of highly dense wireless local area networks (WLAN) can cause an excessive level of interference in the commonly used 2.4 GHz ISM band, which leads to network performance degradation. This paper analyses the possibility to reduce congestion in the crowded ISM band by allowing some access points (APs) to opportunistically operate in a primary band. Although the problem of opportunistic channel allocation considering both ISM and primary bands can be formulated mathematically as a Binary Linear Programming (BLP) problem, existing algorithms (e.g., branch and bound) capable to provide optimal solutions for BLP problems are quite inefficient for large deployments. Therefore, we propose three different heuristic algorithms to solve this opportunistic channel allocation problem by properly extending graph coloring algorithms: First Fit (FF), Saturation Degree Ordering (SDO) and Minimum Spanning Tree (MST). A performance analysis of the three algorithms is carried out under different conditions of primary band availability and AP densityPostprint (published version

    Opportunistic channel allocation algorithms for WLANs based on IEEE802.11

    No full text
    The deployment of highly dense wireless local area networks (WLAN) can cause an excessive level of interference in the commonly used 2.4 GHz ISM band, which leads to network performance degradation. This paper analyses the possibility to reduce congestion in the crowded ISM band by allowing some access points (APs) to opportunistically operate in a primary band. Although the problem of opportunistic channel allocation considering both ISM and primary bands can be formulated mathematically as a Binary Linear Programming (BLP) problem, existing algorithms (e.g., branch and bound) capable to provide optimal solutions for BLP problems are quite inefficient for large deployments. Therefore, we propose three different heuristic algorithms to solve this opportunistic channel allocation problem by properly extending graph coloring algorithms: First Fit (FF), Saturation Degree Ordering (SDO) and Minimum Spanning Tree (MST). A performance analysis of the three algorithms is carried out under different conditions of primary band availability and AP densit

    Performance evaluation of RC flexural elements strengthened by advanced composites

    No full text
    Available from British Library Document Supply Centre-DSC:DXN050890 / BLDSC - British Library Document Supply CentreSIGLEGBUnited Kingdo

    Radio environmental maps: information models and reference model. Document number D4.1

    No full text
    Deliverable D4.1 del projecte Europeu FARAMIR (248351)We describe herein the envisioned improvements of the REMs due to advanced sensing and processing. In relation to that, we also discuss the underlying modelling assumptions. Finally, we comment on how REMs can be of use in different scenarios as established in WP2.Postprint (published version
    corecore